package acwing.lq.递归and递推;

import java.util.Scanner;

/**
 * @description:
 * @author: qian
 * @createDate: 2021/11/10
 */
public class 简单斐波那契 {

    static int N = 47; // 数据范围
    static int[] f = new int[N];

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        f[1] = 0;
        f[2] = 1;
        int n = scanner.nextInt();
        for (int i = 1; i <= n; i++) {
            f[i] = f[i - 1] + f[i - 2];
        }
    }
}
